Finite distributive nearlattices
نویسندگان
چکیده
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This generalizes the well-known given by Birkhoff lattices posets. We also study concepts of dual atoms, boolean elements, complemented elements and irreducible elements. prove that sets form semi-boolean algebras. show set lattice lattice.
منابع مشابه
FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملCohomology of finite monogenic self-distributive structures
A shelf is a set with a binary operation ⊲ satisfying a ⊲ (b ⊲ c) = (a ⊲ b) ⊲ (a ⊲ c). Racks are shelves with invertible translations b 7→ a ⊲ b; many of their aspects, including cohomological, are better understood than those of general shelves. Finite monogenic shelves (FMS), of which Laver tables and cyclic racks are the most famous examples, form a remarkably rich family of structures and p...
متن کاملReimer's Inequality on a Finite Distributive Lattice
We generalize Reimer’s Inequality [6] (a.k.a the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices. (MSC 60C05)
متن کاملOn (finite) distributive lattices with antitone involutions
Some well-known algebras of logic or other algebraic models of non-classical reasoning, such as MV-algebras or orthomodular lattices, can be regarded as lattices with antitone involutions, i.e., bounded lattices with the property that all principal filters (or ideals) are equipped with antitone involutions. This simple observation is behind the so-called “basic algebras” that were introduced in...
متن کاملRepresentation Theorem for Finite Distributive Lattices
1. INDUCTION IN A FINITE LATTICE Let L be a 1-sorted structure and let A, B be subsets of L. Let us observe that A⊆ B if and only if: (Def. 1) For every element x of L such that x ∈ A holds x ∈ B. Let L be a lattice. Observe that there exists a chain of L which is non empty. Let L be a lattice and let x, y be elements of L. Let us assume that x ≤ y. A non empty chain of L is called a x-chain of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112511